Simplicial Closure and Higher-order Link Prediction

نویسندگان

  • Austin R. Benson
  • Rediet Abebe
  • Michael T. Schaub
  • Ali Jadbabaie
  • Jon M. Kleinberg
چکیده

Networks provide a powerful formalism for modeling complex sys-tems, by representing the underlying set of pairwise interactions.But much of the structure within these systems involves interac-tions that take place among more than two nodes at once — forexample, communication within a group rather than person-to-person, collaboration among a team rather than a pair of co-authors,or biological interaction between a set of molecules rather thanjust two. We refer to these type of simultaneous interactions onsets of more than two nodes as higher-order interactions; they areubiquitous, but the empirical study of them has lacked a generalframework for evaluating higher-order models. Here we introducesuch a framework, based on link prediction, a fundamental prob-lem in network analysis. The traditional link prediction problemseeks to predict the appearance of new links in a network, and herewe adapt it to predict which (larger) sets of elements will have fu-ture interactions. We study the temporal evolution of 19 datasetsfrom a variety of domains, and use our higher-order formulationof link prediction to assess the types of structural features that aremost predictive of new multi-way interactions. Among our results,we find that different domains vary considerably in their distri-bution of higher-order structural parameters, and that the higher-order link prediction problem exhibits some fundamental differ-ences from traditional pairwise link prediction, with a greater rolefor local rather than long-range information in predicting the ap-pearance of new interactions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

As Strong as the Weakest Link: Mining Diverse Cliques in Weighted Graphs Appendix

1. Although graphs may not be the ideal framework for modeling higher-order interactions, and hypergraphs or simplicial complexes [3, 15, 7] may be the preferred approach, algorithms for the latter settings are computationally demanding. 2. To validate the developed theories, one would need empirical datasets featuring a sufficient number of instances where a subgroup has interacted, and such d...

متن کامل

Vertex Decomposable Simplicial Complexes Associated to Path Graphs

Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...

متن کامل

Link Prediction using Network Embedding based on Global Similarity

Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...

متن کامل

Market Closure and the Liquidity Premium Puzzle

In contrast to empirical evidence, standard theories conclude that transaction costs only have a second order effect on liquidity premia. In this paper, we show that if one incorporates the well-established fact that market volatility during trading periods is significantly higher than during nontrading periods, then transaction costs have a first order effect that is much greater than that fou...

متن کامل

A Link Prediction Method Based on Learning Automata in Social Networks

Nowadays, online social networks are considered as one of the most important emerging phenomena of human societies. In these networks, prediction of link by relying on the knowledge existing of the interaction between network actors provides an estimation of the probability of creation of a new relationship in future. A wide range of applications can be found for link prediction such as electro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1802.06916  شماره 

صفحات  -

تاریخ انتشار 2018